lexicographic goal programming approach for portfolio optimization

this paper will investigate the optimum portfolio for an investor, taking into account 5 criteria. the mean variance model of portfolio optimization that was introduced by markowitz includes two objective functions; these two criteria, risk and return do not encompass all of the information about investment; information like annual dividends, s&p star ranking and return in later years which is estimated by using data from a longer history. thus portfolio selection is a typical multi-objective decision making (modm) problem. it is well known that goal programming (gp), based on preemptive priorities and target values, has been successful in solving modm problems. in this paper we rank objectives of the modm model according to weights elicited from decision maker’s (dm) preferences. then we obtain goals from dm’s opinion. as a guidance for dm, we revise these goals consistent with ranking of objectives by a linear programming model in a way that new goals remain as close as possible to dm’s goals. after obtaining the goals we solve our modm problem by a lexicographic goal programming (lgp) model which is constructed by prioritizing objectives. finally we il-lustrate our proposed lgp model by a numerical example.